Information-Theoretic Capacity of Clustered Random Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information-theoretic capacity of multi-receiver networks

We consider multi-receiver networks with diversity reception from an information-theoretic point of view. In particular we nd their capacity and investigate how the frequency spectrum should be allocated to the users. We conclude that eecient transmission schemes cannot be built based on re-use partitioning and therefore advocate a spread spectrum approach. We also show that diierences in recei...

متن کامل

On Capacity Scaling of Underwater Networks: An Information-Theoretic Perspective

Capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is t...

متن کامل

Site percolation in clustered random networks

In [1] a model was introduced for the creation of a class of random networks with nonzero clustering. Within this model the degree distribution and clustering spectrum of a network are prescribed, and as such can be fitted to given real-world data. Here we present an analytical approach to site percolation in these networks. Theoretical predictions for the critical site occupation probability a...

متن کامل

Percolation and epidemics in random clustered networks.

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree n...

متن کامل

Information-Theoretic Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements

This paper studies the Shannon regime for the random displacement of stationary point processes. Let each point of some initial stationary point process in Rn give rise to one daughter point, the location of which is obtained by adding a random vector to the coordinates of the mother point, with all displacement vectors independently and identically distributed for all points. The decoding prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2011

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2011.2159574